Wreath products of cyclic p-groups as automorphism groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wreath products of cyclic p-groups as automorphism groups

We prove that if p is a prime and W is the standard wreath product of two nontrivial cyclic p-groups X and Y then W is isomorphic to the full automorphism group of some group if and only if |X| = 2 and |Y | is 2 or 4.

متن کامل

Automorphism Groups for Semidirect Products of Cyclic Groups

Every semidirect product of groups K oH has size |K| · |H|, yet the size of such a group’s automorphism group varies with the chosen action of H on K. This paper will explore groups of the form Aut(K oH), considering especially the case where H and K are cyclic. Only finite groups will be considered.

متن کامل

Automorphism Groups of Wreath Product Digraphs

We strengthen a classical result of Sabidussi giving a necessary and sufficient condition on two graphs, X and Y , for the automorphsim group of the wreath product of the graphs, Aut(X o Y ) to be the wreath product of the automorphism groups Aut(X) o Aut(Y ). We also generalize this to arrive at a similar condition on color digraphs. The main purpose of this paper is to revisit a well-known an...

متن کامل

WREATH PRODUCTS AND REPRESENTATIONS OF p-LOCAL FINITE GROUPS

Given two finite p-local finite groups and a fusion preserving morphism between their Sylow subgroups, we study the question of extending it to a continuous map between the classifying spaces. The results depend on the construction of the wreath product of p-local finite groups which is also used to study p-local permutation representations.

متن کامل

New pattern matching conditions for wreath products of the cyclic groups with symmetric groups

We present several multi-variable generating functions for a new pattern matching condition on the wreath product Ck o Sn of the cyclic group Ck and the symmetric group Sn. Our new pattern matching condition requires that the underlying permutations match in the usual sense of pattern matching for Sn and that the corresponding sequence of signs match in the sense of words, rather than the exact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2004

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2003.08.023